Tabu search algorithm for codebook generation in vector quantization
نویسندگان
چکیده
A tabu search algorithm is proposed for the codebook generation in vector quantization. The key question is the definition of neighboring solution. Making random modifications to the current solution is not sufficient alone. The proposed algorithm first makes non-local changes to the codebook which is then fine-tuned by the generalized Lloyd algorithm (GLA). For a set of gray scale images, the new algorithm was better than GLA alone, and its results were comparable to simulated annealing. For binary images, the tabu search approach gave the best MSE-values.
منابع مشابه
A Survey of VQ Codebook Generation
One of the key roles of Vector Quantization (VQ) is how to generate a good codebook such that the distortion between the original image and the reconstructed image is the minimum. In the past years, many improved algorithms of VQ codebook generation approaches have been developed. In this paper, we present a snapshot of the recent developed schemes. The discussed schemes include mean-distance-o...
متن کاملAn evolution-based tabu search approach to codebook design
This paper presents an evolution-based tabu search approach (ETSA) to design codebooks with smaller distortion values in vector quantization. In the ETSA, there is no need for users to determine the size of a tabu memory and to specifically define a set of tabu restrictions and a set of aspiration criteria. During iterations, only the best solution visited is memorized as a tabu point in the se...
متن کاملA Tabu Seach Based Maximum Descent Algorithm for VQ Codebook Design
HSIANG-CHEH HUANG, SHU-CHUAN CHU, JENG-SHYANG PAN AND ZHE-MING LU Department of Electronics Engineering National Chiao Tung University Hsinchu, 300 Taiwan School of Informatics and Engineering Flinders University of South Australia Australia Department of Electronic Engineering National Kaohsiung University of Applied Sciences Kaohsiung, 807 Taiwan E-mail: [email protected] Department of Aut...
متن کاملA Distributed Reinforcement Learning Approach to Pattern Inference in Go
This paper shows that the distributed representation found in Learning Vector Quantization (LVQ) enables reinforcement learning methods to cope with a large decision search space, defined in terms of equivalence classes of input patterns like those found in the game of Go. In particular, this paper describes S[arsa]LVQ, a novel reinforcement learning algorithm and shows its feasibility for patt...
متن کاملSpeech Recognition with Hierarchical Codebook Search
3 1 Specifications 4 1.1 Problem Description . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.2 The Decimation Algorithm . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 1.3 Goal . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2 Preconditions 6 2.1 Distortion and Distance Measurement . . . . . . . . . . . . . . . . . . . . . . 6 2.2 Ra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Pattern Recognition
دوره 31 شماره
صفحات -
تاریخ انتشار 1998